The randomized complexity of initial value problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The randomized complexity of initial value problems

We study the complexity of randomized solution of initial value problems for systems of ordinary differential equations (ODE). The input data are assumed to be γ-smooth (γ = r+% : the r-th derivatives satisfy a %-Hölder condition). Recently, the following almost sharp estimate of the order of the n-th minimal error was given by Kacewicz (Almost optimal solution of initial-value problems by rand...

متن کامل

Complexity of Initial Value Problems

How complex could the solution be to an initial value problem given by a polynomial-time computable function? This question can be given a natural and precise sense in computational complexity theory. In this note, we put together several results stating that more conditions on the problem make the solution simpler. In particular, Lipschitz continuity alone may leave the solution polynomial-spa...

متن کامل

Computational Complexity of Initial Value Problems (draft)

h.0/ D 0; h.t/ D g t; h.t/ ; t 2 Œ0; 1 (1) in h W Œ0; 1 ! R (Figure 1). A simple sufficient condition that guarantees unique existence of solution h is that g be Lipschitz continuous (along its second argument), which is to say, jg.t;y0/ g.t;y1/j L jy0 y1j; t 2 Œ0; 1; y0;y1 2 R (2) for some constant L independent of y0, y1 and t [16]. We are interested in the computational complexity of the ...

متن کامل

Improved bounds on the randomized and quantum complexity of initial-value problems

We study the problem, initiated in [8], of finding randomized and quantum complexity of initial-value problems. We showed in [8] that a speed-up in both settings over the worst-case deterministic complexity is possible. In the present paper we prove, by defining new algorithms, that further improvement in upper bounds on the randomized and quantum complexity can be achieved. In the Hölder class...

متن کامل

On the randomized solution of initial value problems

Recently S. Heinrich and B. Milla presented an order optimal randomized algorithm solving this problem for γ-smooth input data (i.e. γ = r + ρ: the r-th derivatives of f satisfy a ρ-Hölder condition). This algorithm uses function values and values of derivatives of f . In this paper we present an order optimal randomized algorithm for the class of γ-smooth functions that uses only values of f ....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Complexity

سال: 2008

ISSN: 0885-064X

DOI: 10.1016/j.jco.2007.09.002